A divide-and-merge methodology for clustering
نویسندگان
چکیده
منابع مشابه
GX-Means: A model-based divide and merge algorithm for geospatial image clustering
One of the practical issues in clustering is the specification of the appropriate number of clusters, which is not obvious when analyzing geospatial datasets, partly because they are huge (both in size and spatial extent) and high dimensional. In this paper we present a computationally efficient model-based split and merge clustering algorithm that incrementally finds model parameters and the n...
متن کاملDivide and Merge Classification for High Dimensional Multi-Class Datasets
If a dataset has multiple classes and huge features like microarray data, classification accuracy may be low, even though feature selections are applied to reduce the dimensions of the dataset. Improvement of classification accuracy for the dataset is a challenging task. We propose an efficient classification method based on the “Divide-and-Merge” approach for high dimensional multi-class datas...
متن کاملpassivity in waiting for godot and endgame: a psychoanalytic reading
this study intends to investigate samuel beckett’s waiting for godot and endgame under the lacanian psychoanalysis. it begins by explaining the most important concepts of lacanian psychoanalysis. the beckettian characters are studied regarding their state of unconscious, and not the state of consciousness as is common in most beckett studies. according to lacan, language plays the sole role in ...
Modal Merge and Minimal Move for Dislocation and Verb Clustering
Apparently non-related phenomena like wh-movement and Dutch verb clustering can be handled as bounded varieties of generalized composition in a categorial framework. This supports the unification of merge and move from an operational point of view. It abstracts away from hypothetical reasoning as an instrument of grammatical deduction.
متن کاملCorrelation clustering: divide and conquer
The correlation clustering is an NP-hard problem, hence its solving methods do not scale well. The contraction method and its improvement enable us to construct a divide and conquer algorithm, which could help us to clustering bigger sets. In this article we present the contraction method and compare the effectiveness of this new new and our old methods.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Database Systems
سال: 2006
ISSN: 0362-5915,1557-4644
DOI: 10.1145/1189769.1189779